One-loop diagrams in the random Euclidean matching problem
نویسندگان
چکیده
منابع مشابه
One-loop diagrams in the Random Euclidean Matching Problem
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e., the optimal matching problem between points randomly distributed on a d-dimensional Euclidean space, where the cost to minimize depends on the points' pairwise distances. Using May...
متن کاملOne-loop amplitudes in Euclidean quantum gravity.
Giampiero Esposito, Alexander Yu. Kamenshchik, Igor V. Mishakov, and Giuseppe Pollifrone Istituto Nazionale di Fisica Nucleare, Sezione di Napoli, Mostra d'Oltremare Padiglione 20, 80125 Napoli, Italy Dipartimento di Scienze Fisiche, Mostra d'Oltremare Padiglione 19, 80125 Napoli, Italy Nuclear Safety Institute, Russian Academy of Sciences, 52 Bolshaya Tulskaya, Moscow, 113191, Russia Dipartime...
متن کاملThe quadratic stochastic Euclidean bipartite matching problem
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A prev...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملRandom Matching in the College Admissions Problem
In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilbria. Namely, every ordinal equilibrium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and su¢ cient condition for an equilibrium outco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2017
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.95.012302